On One Estimate for Periodic Functions
نویسندگان
چکیده
منابع مشابه
Error estimate and unfolding for periodic homogenization
This paper deals with the error estimate in problems of periodic homogenization. The methods used are those of the periodic unfolding. We give the upper bound of the distance between the unfolded gradient of a function belonging to H(Ω) and the space ∇xH(Ω)⊕∇yL(Ω;H per(Y )). These distances are obtained thanks to a technical result presented in Theorem 2.3 : the periodic defect of a harmonic fu...
متن کاملInterior error estimate for periodic homogenization
In a previous article about the homogenization of the classical problem of diffusion in a bounded domain with sufficiently smooth boundary we proved that the error is of order ε. Now, for an open set Ω with sufficiently smooth boundary (C) and homogeneous Dirichlet or Neuman limits conditions we show that in any open set strongly included in Ω the error is of order ε. If the open set Ω⊂R is of ...
متن کاملPeriodic Lyapunov functions for periodic TS systems
In this paper we consider stability analysis and controller design for periodic Takagi-Sugeno fuzzy models. To develop the conditions, we use a switching nonquadratic Lyapunov function defined at the time instants when the subsystems switch. Using the proposed conditions we are able to handle periodic Takagi-Sugeno systems where the local models or even the subsystems are unstable or cannot be ...
متن کاملAlgorithms for Periodic Functions
In this chapter we show how to compute the Discrete Fourier Transform using a Fast Fourier Transform (FFT) algorithm, including not-so special case situations such as when the data to be transformed are real. In those situations, we speed up the transforms by about a factor of two by exploiting symmetries in the data and the coefficients. We end this chapter by showing how to approximate the de...
متن کاملAlgorithms for Periodic Functions
In this chapter we show how to compute the Discrete Fourier Transform using a Fast Fourier Transform (FFT) algorithm, including not-so special case situations such as when the data to be transformed are real. In those situations, we speed up the transforms by about a factor of two by exploiting symmetries in the data and the coefficients. We end this chapter by showing how to approximate the de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: gmj
سال: 2005
ISSN: 1572-9176,1072-947X
DOI: 10.1515/gmj.2005.97